منابع مشابه
The Weizmann Institute of Sciencethe
Fast numerical evaluation of integral transforms on an adaptive grid, i.e. using local grid reenement, requires an algorithm that relies on smoothness properties only of the continuum kernel, independent of its discrete form. The basic outline of such an algorithm was given in 6], where it was shown that already on a uniform grid this algorithm was more eecient than earlier fast evaluation algo...
متن کاملThe Weizmann Institute of Science Faculty
Bloom filters and Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error. Unlike Bloom filters, CBFs also support element deletions. In the first part of the talk, I will introduce a new general method based on variable increments to improve the efficiency of CBFs and their variants....
متن کاملThe Weizmann Institute of Science Faculty of Mathematics And
Bloom filters and Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error. Unlike Bloom filters, CBFs also support element deletions. In the first part of the talk, I will introduce a new general method based on variable increments to improve the efficiency of CBFs and their variants....
متن کاملTHE WEIZMANN INSTITUTE OF SCIENCE FACULTY OF MATHEMATICS AND COMPUTER SCIENCE Vision
Recent progress in imaging technologies leads to a continuous growth in biomedical data, which can provide better insight into important clinical and biological questions. Advanced machine learning techniques, such as artificial neural networks are brought to bear on addressing fundamental medical image computing challenges such as segmentation, classification and reconstruction, required for m...
متن کاملTHE WEIZMANN INSTITUTE OF SCIENCE FACULTY OF MATHEMATICS AND COMPUTER SCIENCE Foundations
Bloom filters and Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error. Unlike Bloom filters, CBFs also support element deletions. In the first part of the talk, I will introduce a new general method based on variable increments to improve the efficiency of CBFs and their variants....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1985
ISSN: 0028-0836,1476-4687
DOI: 10.1038/317761c0